A Bayesian Conjugate Gradient Method (with Discussion)
نویسندگان
چکیده
منابع مشابه
A Bayesian Conjugate Gradient Method
A fundamental task in numerical computation is the solution of large linear systems. The conjugate gradient method is an iterative method which offers rapid convergence to the solution, particularly when an effective preconditioner is employed. However, for more challenging systems a substantial error can be present even after many iterations have been performed. The estimates obtained in this ...
متن کاملA conjugate gradient based method for Decision Neural Network training
Decision Neural Network is a new approach for solving multi-objective decision-making problems based on artificial neural networks. Using inaccurate evaluation data, network training has improved and the number of educational data sets has decreased. The available training method is based on the gradient decent method (BP). One of its limitations is related to its convergence speed. Therefore,...
متن کاملDiscussion of “ A New Preconditioned Conjugate Gradient Power Flow ”
The authors [1] should be commended for their interesting contribution to the power flow solution via iterative methods. The availability of a good preconditioner is perhaps the decisive factor influencing whether or not iterative solvers would have an impact in the future of power flow calculations in power systems. The paper contributes in this direction. I would like to bring to the attentio...
متن کاملCrack Detection In Functionally Graded Beams Using Conjugate Gradient Method
In this paper the conjugate gradient (CG) method is employed for identifying the parameters of crack in a functionally graded beam from natural frequency measurement. The crack is modeled as a massless rotational spring with sectional flexibility. By using the Euler-Bernoulli beam theory on two separate beams respectively and applying the compatibility requirements of the crack, the characteris...
متن کاملA Perry Descent Conjugate Gradient Method with Restricted Spectrum
A. A new nonlinear conjugate gradient method, based on Perry’s idea, is presented. And it is shown that its sufficient descent property is independent of any line search and the eigenvalues of Pk+1Pk+1 are bounded above, where Pk+1 is the iteration matrix of the new method. Thus, the global convergence is proven by the spectral analysis for nonconvex functions when the line search fulfil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bayesian Analysis
سال: 2019
ISSN: 1936-0975
DOI: 10.1214/19-ba1145